Uncovering deterministic causal structures: a Boolean approach

نویسنده

  • Michael Baumgartner
چکیده

While standard procedures of causal reasoning as procedures analyzing causal Bayesian networks are custom-built for (non-deterministic) probabilistic structures, this paper introduces a Boolean procedure that uncovers deterministic causal structures. Contrary to existing Boolean methodologies, the procedure advanced here successfully analyzes structures of arbitrary complexity. It roughly involves three parts: first, deterministic dependencies are identified in the data; second, these dependencies are suitably minimalized in order to eliminate redundancies; and third, one or – in case of ambiguities – more than one causal structure is assigned to the minimalized deterministic dependencies.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Causal Nets or What is a Deterministic Computation

The network approach to computation is more direct and “physical” than the one based on some specific computing devices (like Turing machines). However, the size of a usual—e.g., Boolean—network does not reflect the complexity of computing the corresponding function, since a small network may be very hard to find even if it exists. A history of the work of a particular computing device can be d...

متن کامل

Inferring Causal Complexity

In The Comparative Method, Ragin (1987) outlined a procedure of Boolean causal reasoning operating on pure coincidence data that has since become widely known asQCA (Qualitative Comparative Analysis) among social scientists. QCA—also in its recent forms as presented in Ragin (2000, 2008)— is designed to analyze causal structures featuring no more than one effect and a possibly complex configura...

متن کامل

Learning Deterministic Causal Networks from Observational Data

Previous work suggests that humans find it difficult to learn the structure of causal systems given observational data alone. We show that structure learning is successful when the causal systems in question are consistent with people’s expectations that causal relationships are deterministic and that each pattern of observations has a single underlying cause. Our data are well explained by a B...

متن کامل

A Qualitative Characterisation of Causal Independence Models Using Boolean Polynomials

Causal independence models offer a high level starting point for the design of Bayesian networks but are not maximally exploited as their behaviour is often unclear. One approach is to employ qualitative probabilistic network theory in order to derive a qualitative characterisation of causal independence models. In this paper we exploit polynomial forms of Boolean functions to systematically an...

متن کامل

Reverse Engineering of Asynchronous Boolean Networks via Minimum Explanatory Set and Maximum Likelihood

In this paper, we propose an approach for reconstructing asynchronous Boolean networks from observed data. We find the causal relationships in Boolean networks using an asynchronous evolution approach. In our approach, we first find a minimum explanatory set for a node to reduce complexity of candidate Boolean functions, and then we choose a Boolean function for the node based on the maximum li...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Synthese

دوره 170  شماره 

صفحات  -

تاریخ انتشار 2009